Understanding the complexities of retractions: Recommended resources

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projections and Retractions

The main result of this paper is a generalization of a theorem of R. S. Phillips [6] on the nonexistence of projections of l°° onto c0. If S is a locally compact Hausdorff space then let C(S) denote the space of bounded continuous real (or complex) valued functions on 5; also, let Co(S) be those functions in C(S) which vanish at infinity. If N is the space of positive integers with the discrete...

متن کامل

Understanding spatial complexities: could similes and metaphors be useful?

Are there possible benefits to be gained from emulating the human way (of thought and language) with a machine way? This article outlines the concepts of similes and metaphors. This article aims to emphasise that similes and metaphors can be utilised to help understand and extract useful information from spatial data. As similes and metaphors are utilised in human language and understandings it...

متن کامل

Understanding environmental and geographical complexities through similarity matching

This article illustrates similarity-matching techniques applied to environmental and geographical information domains. The general concept outlined is that similarity is a generative technique to analyse the cached information inherent in physical and social sciences. In essence, similarity is utilised to group natural kinds that manifest similar amenities in complex environments.

متن کامل

I-40: The Genetic Complexities of Human Sex-Determination

Background - MaterialsAndMethods N;Results N;Conclusion N;

متن کامل

Retractions to Pseudoforests

For a fixed graph H, let Ret(H) denote the problem of deciding whether a given input graph is retractable to H. We classify the complexity of Ret(H) when H is a graph (with loops allowed) where each connected component has at most one cycle, i.e., a pseudoforest. In particular, this result extends the known complexity classifications of Ret(H) for reflexive and irreflexive cycles to general cyc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: College & Research Libraries News

سال: 2018

ISSN: 2150-6698,0099-0086

DOI: 10.5860/crln.79.1.38